Point Cloud Data Simplification Using Movable Mesh Generation

نویسنده

  • Huang Ming
چکیده

In order to realize massive point cloud data simplification, a new movable mesh generation algorithm was proposed. Firstly, point cloud model was divided into a number of spatial grids. Secondly, the mesh generation was made like the first step again but more finely and with respecting of the distance threshold, and then, each appropriate point of the grids generated by the second step was filtered out according to the weight values. At last, the position of the minimum point of point cloud model's bounding box was moved, next do the mesh generation again and filter out the final points. Experimental results indicate that the proposed simplification method is able to eliminate redundant data effectively. The reduction performance of this method is superior to the distance simplification method of Geomagic Studio obviously under the same required accuracy. It can be used in the real-time data acquisition process of 3D Reconstruction.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intrinsic point cloud simplification

Modelling and visualisation methods working directly with point-sampled geometry have developed into attractive alternatives to more traditional mesh-based surface processing. In this paper, we consider a vital step in any point-based surface processing pipeline, point cloud simplification. Building upon the intrinsic point cloud simplification idea put forward in [14], we obtain a simplificati...

متن کامل

Point-based Tetrahedral Mesh Simplification with Intersection-Free Surface Mesh Simplification

Simplification of tetrahedral meshes is an important tool to decrease the complexity of these datasets. Many visualization systems need the simplified version of a mesh to be fully interactive. This paper presents a rapid tetrahedral simplifier that works in three steps. First, the border of the tetrahedral mesh is simplified. Second, the interior of the mesh is point sampled such that the resu...

متن کامل

Octree Subdivision Using Coplanar Criterion for Hierarchical Point Simplification

This study presents a novel rapid and effective point simplification algorithm based on point clouds without using either normal or connectivity information. Sampled points are clustered based on shape variations by octree data structure, an inner point distribution of a cluster, to judge whether these points correlate with the coplanar characteristics. Accordingly, the relevant point from each...

متن کامل

Efficient Representation of Singular Surfaces with Point Clouds

Modelling surfaces with point clouds is very useful when the original data is itself a point cloud (e.g. obtained by some 3D measurement device). It has been argued that effective point-sampled surface simplification could be obtained directly from the point cloud without having to transform it into a triangular mesh. Modelling surfaces of arbitrary genus with point clouds has already been achi...

متن کامل

Point-based Simplification Algorithm

This study presents a novel, rapid, and effective point simplification algorithm based on a point cloud without any normal and connectivity information. This study is initiated with a scattered sampled point set in three dimensions, and the final output is a triangular mesh model, which is simplified according to a restrictive criteria. The proposed method reduces the number of calculations req...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015